0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command    : run_E %s %d THM
0.13/0.34	% Computer : n003.cluster.edu
0.13/0.34	% Model    : x86_64 x86_64
0.13/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory   : 8042.1875MB
0.13/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 960
0.13/0.34	% WCLimit    : 120
0.13/0.34	% DateTime   : Tue Aug  9 06:22:21 EDT 2022
0.13/0.34	% CPUTime    : 
0.20/0.47	Running higher-order on 8 cores theorem proving
0.20/0.47	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p
0.20/0.47	# Version: 3.0pre003-ho
0.20/0.48	# Preprocessing class: HSSSSLSSSLMNHSA.
0.20/0.48	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.48	# Starting new_ho_10 with 600s (5) cores
0.20/0.48	# Starting new_ho_7 with 120s (1) cores
0.20/0.48	# Starting lpo8_lambda_fix with 120s (1) cores
0.20/0.48	# Starting lpo9_lambda_fix with 120s (1) cores
0.20/0.48	# new_ho_7 with pid 31561 completed with status 0
0.20/0.48	# Result found by new_ho_7
0.20/0.48	# Preprocessing class: HSSSSLSSSLMNHSA.
0.20/0.48	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.48	# Starting new_ho_10 with 600s (5) cores
0.20/0.48	# Starting new_ho_7 with 120s (1) cores
0.20/0.48	# SinE strategy is GSinE(CountFormulas,hypos,3,,5,20000,1.0,true)
0.20/0.48	# ...ProofStateSinE()=5/13
0.20/0.48	# Search class: HGUSF-FFSS22-DHSFMSBN
0.20/0.48	# partial match(3): HGUNF-FFSS22-SHSSMSBN
0.20/0.48	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.20/0.48	# Starting new_ho_10 with 65s (1) cores
0.20/0.48	# new_ho_10 with pid 31564 completed with status 0
0.20/0.48	# Result found by new_ho_10
0.20/0.48	# Preprocessing class: HSSSSLSSSLMNHSA.
0.20/0.48	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.48	# Starting new_ho_10 with 600s (5) cores
0.20/0.48	# Starting new_ho_7 with 120s (1) cores
0.20/0.48	# SinE strategy is GSinE(CountFormulas,hypos,3,,5,20000,1.0,true)
0.20/0.48	# ...ProofStateSinE()=5/13
0.20/0.48	# Search class: HGUSF-FFSS22-DHSFMSBN
0.20/0.48	# partial match(3): HGUNF-FFSS22-SHSSMSBN
0.20/0.48	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.20/0.48	# Starting new_ho_10 with 65s (1) cores
0.20/0.48	# Preprocessing time       : 0.001 s
0.20/0.48	# Presaturation interreduction done
0.20/0.48	
0.20/0.48	# Proof found!
0.20/0.48	# SZS status Theorem
0.20/0.48	# SZS output start CNFRefutation
0.20/0.48	thf(decl_22, type, in: $i > $i > $o).
0.20/0.48	thf(decl_23, type, dsetconstr: $i > ($i > $o) > $i).
0.20/0.48	thf(decl_24, type, dsetconstrI: $o).
0.20/0.48	thf(decl_25, type, setext: $o).
0.20/0.48	thf(decl_26, type, kpair: $i > $i > $i).
0.20/0.48	thf(decl_27, type, cartprod: $i > $i > $i).
0.20/0.48	thf(decl_28, type, cartprodpairin: $o).
0.20/0.48	thf(decl_29, type, dpsetconstr: $i > $i > ($i > $i > $o) > $i).
0.20/0.48	thf(decl_30, type, esk1_2: $i > $i > $i).
0.20/0.48	thf(decl_31, type, esk2_2: $i > $i > $i).
0.20/0.48	thf(decl_32, type, esk3_0: $i).
0.20/0.48	thf(decl_33, type, esk4_0: $i).
0.20/0.48	thf(decl_34, type, epred1_0: $i > $i > $o).
0.20/0.48	thf(decl_35, type, esk5_0: $i).
0.20/0.48	thf(decl_36, type, esk6_0: $i).
0.20/0.48	thf(dsetconstrI, axiom, ((dsetconstrI)<=>![X1:$i, X2:$i > $o, X3:$i]:(((in @ X3 @ X1)=>((X2 @ X3)=>(in @ X3 @ (dsetconstr @ X1 @ (^[X4:$i]:((X2 @ X4))))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', dsetconstrI)).
0.20/0.48	thf(dpsetconstr, axiom, ((dpsetconstr)=(^[X1:$i, X5:$i, X6:$i > $i > $o]:(dsetconstr @ (cartprod @ X1 @ X5) @ (^[X7:$i]:(?[X3:$i]:(((in @ X3 @ X1)&?[X4:$i]:((((in @ X4 @ X5)&(X6 @ X3 @ X4))&((X7)=(kpair @ X3 @ X4))))))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', dpsetconstr)).
0.20/0.48	thf(dpsetconstrI, conjecture, ((((cartprodpairin)=>![X1:$i, X5:$i, X8:$i > $i > $o, X3:$i]:(((in @ X3 @ X1)=>![X4:$i]:((((X8 @ X3 @ X4)=>(in @ (kpair @ X3 @ X4) @ (dpsetconstr @ X1 @ X5 @ (^[X9:$i, X7:$i]:((X8 @ X9 @ X7))))))<=(in @ X4 @ X5))))))<=(setext))<=(dsetconstrI)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', dpsetconstrI)).
0.20/0.48	thf(cartprodpairin, axiom, ((cartprodpairin)<=>![X1:$i, X5:$i, X3:$i]:(((in @ X3 @ X1)=>![X4:$i]:(((in @ X4 @ X5)=>(in @ (kpair @ X3 @ X4) @ (cartprod @ X1 @ X5))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cartprodpairin)).
0.20/0.48	thf(setext, axiom, ((setext)<=>![X1:$i, X5:$i]:((![X3:$i]:(((in @ X3 @ X1)=>(in @ X3 @ X5)))=>(![X3:$i]:(((in @ X3 @ X5)=>(in @ X3 @ X1)))=>((X1)=(X5)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', setext)).
0.20/0.48	thf(c_0_5, plain, ((dsetconstrI)<=>![X1:$i, X2:$i > $o, X3:$i]:(((in @ X3 @ X1)=>((X2 @ X3)=>(in @ X3 @ (dsetconstr @ X1 @ (^[Z0:$i]:((X2 @ Z0))))))))), inference(fof_simplification,[status(thm)],[dsetconstrI])).
0.20/0.48	thf(c_0_6, plain, ((dpsetconstr)=(^[Z0:$i, Z1:$i, Z2:$i > $i > $o]:(dsetconstr @ (cartprod @ Z0 @ Z1) @ (^[Z3:$i]:(?[X3:$i]:(((in @ X3 @ Z0)&?[X4:$i]:((((in @ X4 @ Z1)&(Z2 @ X3 @ X4))&((Z3)=(kpair @ X3 @ X4))))))))))), inference(fof_simplification,[status(thm)],[dpsetconstr])).
0.20/0.48	thf(c_0_7, negated_conjecture, ~((![X36:$i, X37:$i > $o, X38:$i]:(((in @ X38 @ X36)=>((X37 @ X38)=>(in @ X38 @ (dsetconstr @ X36 @ (^[Z0:$i]:((X37 @ Z0))))))))=>(![X32:$i, X33:$i]:((![X34:$i]:(((in @ X34 @ X32)=>(in @ X34 @ X33)))=>(![X35:$i]:(((in @ X35 @ X33)=>(in @ X35 @ X32)))=>((X32)=(X33)))))=>(![X26:$i, X27:$i, X28:$i]:(((in @ X28 @ X26)=>![X29:$i]:(((in @ X29 @ X27)=>(in @ (kpair @ X28 @ X29) @ (cartprod @ X26 @ X27))))))=>![X1:$i, X5:$i, X8:$i > $i > $o, X3:$i]:(((in @ X3 @ X1)=>![X4:$i]:(((in @ X4 @ X5)=>((X8 @ X3 @ X4)=>(in @ (kpair @ X3 @ X4) @ (dsetconstr @ (cartprod @ X1 @ X5) @ (^[Z0:$i]:(?[X30:$i]:(((in @ X30 @ X1)&?[X31:$i]:((((in @ X31 @ X5)&(X8 @ X30 @ X31))&((Z0)=(kpair @ X30 @ X31))))))))))))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[dpsetconstrI])]), c_0_5]), c_0_6]), cartprodpairin]), setext])])).
0.20/0.48	thf(c_0_8, negated_conjecture, ![X39:$i, X40:$i > $o, X41:$i, X42:$i, X43:$i, X46:$i, X47:$i, X48:$i, X49:$i]:(((~(in @ X41 @ X39)|(~(X40 @ X41)|(in @ X41 @ (dsetconstr @ X39 @ (^[Z0:$i]:((X40 @ Z0)))))))&(((((in @ (esk2_2 @ X42 @ X43) @ X43)|((X42)=(X43))|(in @ (esk1_2 @ X42 @ X43) @ X42))&(~(in @ (esk2_2 @ X42 @ X43) @ X42)|((X42)=(X43))|(in @ (esk1_2 @ X42 @ X43) @ X42)))&(((in @ (esk2_2 @ X42 @ X43) @ X43)|((X42)=(X43))|~(in @ (esk1_2 @ X42 @ X43) @ X43))&(~(in @ (esk2_2 @ X42 @ X43) @ X42)|((X42)=(X43))|~(in @ (esk1_2 @ X42 @ X43) @ X43))))&((~(in @ X48 @ X46)|(~(in @ X49 @ X47)|(in @ (kpair @ X48 @ X49) @ (cartprod @ X46 @ X47))))&((in @ esk5_0 @ esk3_0)&((in @ esk6_0 @ esk4_0)&((epred1_0 @ esk5_0 @ esk6_0)&~(in @ (kpair @ esk5_0 @ esk6_0) @ (dsetconstr @ (cartprod @ esk3_0 @ esk4_0) @ (^[Z0:$i]:(?[X30:$i]:(((in @ X30 @ esk3_0)&?[X31:$i]:((((in @ X31 @ esk4_0)&(epred1_0 @ X30 @ X31))&((Z0)=(kpair @ X30 @ X31))))))))))))))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])])).
0.20/0.48	thf(c_0_9, negated_conjecture, ~((in @ (kpair @ esk5_0 @ esk6_0) @ (dsetconstr @ (cartprod @ esk3_0 @ esk4_0) @ (^[Z0:$i]:(?[X59:$i]:(((in @ X59 @ esk3_0)&?[X60:$i]:((((in @ X60 @ esk4_0)&(epred1_0 @ X59 @ X60))&((Z0)=(kpair @ X59 @ X60))))))))))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.20/0.48	thf(c_0_10, negated_conjecture, ![X3:$i, X2:$i > $o, X1:$i]:(((in @ X1 @ (dsetconstr @ X3 @ X2))|~((in @ X1 @ X3))|~((X2 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.20/0.48	thf(c_0_11, negated_conjecture, (~(?[X61:$i]:(((in @ X61 @ esk3_0)&?[X62:$i]:((((in @ X62 @ esk4_0)&(epred1_0 @ X61 @ X62))&((kpair @ esk5_0 @ esk6_0)=(kpair @ X61 @ X62)))))))|~((in @ (kpair @ esk5_0 @ esk6_0) @ (cartprod @ esk3_0 @ esk4_0)))), inference(spm,[status(thm)],[c_0_9, c_0_10])).
0.20/0.48	thf(c_0_12, negated_conjecture, ![X1:$i, X3:$i]:((((kpair @ esk5_0 @ esk6_0)!=(kpair @ X1 @ X3))|~((in @ (kpair @ esk5_0 @ esk6_0) @ (cartprod @ esk3_0 @ esk4_0)))|~((in @ X1 @ esk3_0))|~((in @ X3 @ esk4_0))|~((epred1_0 @ X1 @ X3)))), inference(dynamic cnf,[status(thm)],[c_0_11])).
0.20/0.48	thf(c_0_13, negated_conjecture, ![X1:$i, X3:$i, X4:$i, X5:$i]:(((in @ (kpair @ X1 @ X4) @ (cartprod @ X3 @ X5))|~((in @ X1 @ X3))|~((in @ X4 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.20/0.48	thf(c_0_14, negated_conjecture, (in @ esk6_0 @ esk4_0), inference(split_conjunct,[status(thm)],[c_0_8])).
0.20/0.48	thf(c_0_15, negated_conjecture, (in @ esk5_0 @ esk3_0), inference(split_conjunct,[status(thm)],[c_0_8])).
0.20/0.48	thf(c_0_16, negated_conjecture, ![X1:$i, X3:$i]:((((kpair @ esk5_0 @ esk6_0)!=(kpair @ X1 @ X3))|~((in @ X1 @ esk3_0))|~((in @ X3 @ esk4_0))|~((epred1_0 @ X1 @ X3)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_14]), c_0_15])])).
0.20/0.48	thf(c_0_17, negated_conjecture, (epred1_0 @ esk5_0 @ esk6_0), inference(split_conjunct,[status(thm)],[c_0_8])).
0.20/0.48	thf(c_0_18, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_16]), c_0_15]), c_0_14]), c_0_17])]), ['proof']).
0.20/0.48	# SZS output end CNFRefutation
0.20/0.48	# Parsed axioms                        : 13
0.20/0.48	# Removed by relevancy pruning/SinE    : 8
0.20/0.48	# Initial clauses                      : 10
0.20/0.48	# Removed in clause preprocessing      : 0
0.20/0.48	# Initial clauses in saturation        : 10
0.20/0.48	# Processed clauses                    : 24
0.20/0.48	# ...of these trivial                  : 0
0.20/0.48	# ...subsumed                          : 0
0.20/0.48	# ...remaining for further processing  : 24
0.20/0.48	# Other redundant clauses eliminated   : 0
0.20/0.48	# Clauses deleted for lack of memory   : 0
0.20/0.48	# Backward-subsumed                    : 1
0.20/0.48	# Backward-rewritten                   : 0
0.20/0.48	# Generated clauses                    : 7
0.20/0.48	# ...of the previous two non-redundant : 6
0.20/0.48	# ...aggressively subsumed             : 0
0.20/0.48	# Contextual simplify-reflections      : 0
0.20/0.48	# Paramodulations                      : 5
0.20/0.48	# Factorizations                       : 0
0.20/0.48	# NegExts                              : 0
0.20/0.48	# Equation resolutions                 : 1
0.20/0.48	# Propositional unsat checks           : 0
0.20/0.48	#    Propositional check models        : 0
0.20/0.48	#    Propositional check unsatisfiable : 0
0.20/0.48	#    Propositional clauses             : 0
0.20/0.48	#    Propositional clauses after purity: 0
0.20/0.48	#    Propositional unsat core size     : 0
0.20/0.48	#    Propositional preprocessing time  : 0.000
0.20/0.48	#    Propositional encoding time       : 0.000
0.20/0.48	#    Propositional solver time         : 0.000
0.20/0.48	#    Success case prop preproc time    : 0.000
0.20/0.48	#    Success case prop encoding time   : 0.000
0.20/0.48	#    Success case prop solver time     : 0.000
0.20/0.48	# Current number of processed clauses  : 12
0.20/0.48	#    Positive orientable unit clauses  : 3
0.20/0.48	#    Positive unorientable unit clauses: 0
0.20/0.48	#    Negative unit clauses             : 1
0.20/0.48	#    Non-unit-clauses                  : 8
0.20/0.48	# Current number of unprocessed clauses: 2
0.20/0.48	# ...number of literals in the above   : 9
0.20/0.48	# Current number of archived formulas  : 0
0.20/0.48	# Current number of archived clauses   : 12
0.20/0.48	# Clause-clause subsumption calls (NU) : 29
0.20/0.48	# Rec. Clause-clause subsumption calls : 21
0.20/0.48	# Non-unit clause-clause subsumptions  : 1
0.20/0.48	# Unit Clause-clause subsumption calls : 0
0.20/0.48	# Rewrite failures with RHS unbound    : 0
0.20/0.48	# BW rewrite match attempts            : 0
0.20/0.48	# BW rewrite match successes           : 0
0.20/0.48	# Condensation attempts                : 24
0.20/0.48	# Condensation successes               : 0
0.20/0.48	# Termbank termtop insertions          : 1903
0.20/0.48	
0.20/0.48	# -------------------------------------------------
0.20/0.48	# User time                : 0.007 s
0.20/0.48	# System time              : 0.001 s
0.20/0.48	# Total time               : 0.008 s
0.20/0.48	# Maximum resident set size: 1908 pages
0.20/0.48	
0.20/0.48	# -------------------------------------------------
0.20/0.48	# User time                : 0.010 s
0.20/0.48	# System time              : 0.001 s
0.20/0.48	# Total time               : 0.011 s
0.20/0.48	# Maximum resident set size: 1736 pages
0.20/0.48	EOF